翻訳と辞書 |
Sophistication (complexity theory) : ウィキペディア英語版 | Sophistication (complexity theory) In algorithmic information theory, sophistication is a measure of complexity related to algorithmic entropy. When K is the Kolmogorov complexity and ''c'' is a constant, the sophistication of ''x'' can be defined as : The constant ''c'' is called significance. The ''S'' variable ranges over finite sets. Intuitively, sophistication measures the complexity of a set of which the object is a "generic" member. __NOTOC__ == See also ==
* Logical depth
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Sophistication (complexity theory)」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|